Computational models of trust for cooperative evolution. Reputation based game theoretic models of trust for cooperative evolution in online business games.

Online services such as e-marketplaces, social networking sites, online gaming environments etc have grown in popularity in the recent years. These services represent situation where participants do not get to negotiate face to face before interaction and most of the time parties to transaction remain anonymous. It is thus necessary to have a system that rightly assesses trustworthiness of the other party in order to maintain quality assurance in such systems. Recent works on Trust and Reputation in online communities have focused on identifying probable defaulters, but less effort has been put to come up with system that make cooperation attractive over defection in order to achieve cooperation without enforcement. Our work in this regard concerns design and investigation of trust assessment systems that not only filter defaulters but also promote evolution of cooperativeness in player society. Based on the concept of game theory and prisoner¿s dilemma, we model business games and design incentive method, compensation method, acquaintance based assessment method and decision theoretic assessment method as mechanisms to assure trustworthiness in online business environments. Effectiveness of each of these methods in promoting the evolution of cooperation in player society has been investigated. Our results show that these methods contribute positively in promoting cooperative evolution. We have further extended our trust assessment model to suit the needs of a mobile ad-hoc network setting. The effectiveness of this model has been tested against its capability to reduce packet drop rate and energy conservation. In both of these the results show promise.EU Asia-link project TH/Asia Link/004(91712) East-West and its local host Kantipur Engineering College in Nepal, and Kathmandu University

TruMet: An approach towards computing trust in multi-agent environment.

The growing popularity of multi-agent based approaches towards the formation and operation of virtual organizations (VO) present over the Internet, offer both opportunities and risks. One of the risks involved in such community is in the identification of trustworthy agent partners for transaction. In this paper we aim to describe our trust model which would contribute in measuring trust in the interacting agents. Named as TruMet, the trust metric model works on the basis of the parameters that we have identified as relevant to the features of the community. The model primarily analyses trust value on the basis of the agent¿s reputation, as provided by the agent itself, and the agent¿s aggregate rating as provided by the witness agents. The final computation of the trust value is given by a weighted average of these two components. While computing the aggregate rating, a weight based method has been adopted to discount the contribution of possibly un-fair ratings by the witness agents

Recommendation based trust model with an effective defence scheme for MANETs

YesThe reliability of delivering packets through multi-hop intermediate nodes is a significant issue in the mobile ad hoc networks (MANETs). The distributed mobile nodes establish connections to form the MANET, which may include selfish and misbehaving nodes. Recommendation based trust management has been proposed in the literature as a mechanism to filter out the misbehaving nodes while searching for a packet delivery route. However, building a trust model that relies on the recommendations from other nodes in the network is vulnerable to the possible dishonest behaviour, such as bad-mouthing, ballot-stuffing, and collusion, of the recommending nodes. . This paper investigates the problems of attacks posed by misbehaving nodes while propagating recommendations in the existing trust models. We propose a recommendation based trust model with a defence scheme that utilises clustering technique to dynamically filter attacks related to dishonest recommendations within certain time based on number of interactions, compatibility of information and node closeness. The model is empirically tested in several mobile and disconnected topologies in which nodes experience changes in their neighbourhoods and consequently face frequent route changes. The empirical analysis demonstrates robustness and accuracy of the trust model in a dynamic MANET environment

Computational models of trust for cooperative evolution : reputation based game theoretic models of trust for cooperative evolution in online business games

Online services such as e-marketplaces, social networking sites, online gaming environments etc have grown in popularity in the recent years. These services represent situation where participants do not get to negotiate face to face before interaction and most of the time parties to transaction remain anonymous. It is thus necessary to have a system that rightly assesses trustworthiness of the other party in order to maintain quality assurance in such systems. Recent works on Trust and Reputation in online communities have focused on identifying probable defaulters, but less effort has been put to come up with system that make cooperation attractive over defection in order to achieve cooperation without enforcement. Our work in this regard concerns design and investigation of trust assessment systems that not only filter defaulters but also promote evolution of cooperativeness in player society. Based on the concept of game theory and prisoner's dilemma, we model business games and design incentive method, compensation method, acquaintance based assessment method and decision theoretic assessment method as mechanisms to assure trustworthiness in online business environments. Effectiveness of each of these methods in promoting the evolution of cooperation in player society has been investigated. Our results show that these methods contribute positively in promoting cooperative evolution. We have further extended our trust assessment model to suit the needs of a mobile ad-hoc network setting. The effectiveness of this model has been tested against its capability to reduce packet drop rate and energy conservation. In both of these the results show promise.EThOS - Electronic Theses Online ServiceEU Asia-link project TH/Asia Link/004(91712) East-West and its local host Kantipur Engineering College in Nepal, and Kathmandu University.GBUnited Kingdo

Computational models of trust for cooperative evolution : reputation based game theoretic models of trust for cooperative evolution in online business games

Online services such as e-marketplaces, social networking sites, online gaming environments etc have grown in popularity in the recent years. These services represent situation where participants do not get to negotiate face to face before interaction and most of the time parties to transaction remain anonymous. It is thus necessary to have a system that rightly assesses trustworthiness of the other party in order to maintain quality assurance in such systems. Recent works on Trust and Reputation in online communities have focused on identifying probable defaulters, but less effort has been put to come up with system that make cooperation attractive over defection in order to achieve cooperation without enforcement. Our work in this regard concerns design and investigation of trust assessment systems that not only filter defaulters but also promote evolution of cooperativeness in player society. Based on the concept of game theory and prisoner's dilemma, we model business games and design incentive method, compensation method, acquaintance based assessment method and decision theoretic assessment method as mechanisms to assure trustworthiness in online business environments. Effectiveness of each of these methods in promoting the evolution of cooperation in player society has been investigated. Our results show that these methods contribute positively in promoting cooperative evolution. We have further extended our trust assessment model to suit the needs of a mobile ad-hoc network setting. The effectiveness of this model has been tested against its capability to reduce packet drop rate and energy conservation. In both of these the results show promise.EThOS - Electronic Theses Online ServiceEU Asia-link project TH/Asia Link/004(91712) East-West and its local host Kantipur Engineering College in Nepal, and Kathmandu University.GBUnited Kingdo